منابع مشابه
Constrained Matroidal Bottleneck Problems
Algorithms for the constrained bottleneck matroid base problem and the constrained bottleneck independent set problem are presented. The algorithms have improved complexities upon the best known general algorithm. Sufficient conditions are obtained when the proposed algorithms have linear complexity and are therefore the best possible ones. Several specific classes of matroidal problems are con...
متن کاملUpgrading Bottleneck Constrained Forests
We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to nd a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The performance is measured by the bottleneck weight of a con...
متن کاملGeneralizing Bottleneck Problems
Given a pair of random variables (X,Y ) ∼ PXY and two convex functions f1 and f2, we introduce two bottleneck functionals as the lower and upper boundaries of the two-dimensional convex set that consists of the pairs (If1(W ;X), If2(W ;Y )), where If denotes f -information and W varies over the set of all discrete random variables satisfying the Markov condition W → X → Y . Applying Witsenhause...
متن کاملDiscrete profile alignment via constrained information bottleneck
Amino acid profiles, which capture position-specific mutation probabilities, are a richer encoding of biological sequences than the individual sequences themselves. However, profile comparisons are much more computationally expensive than discrete symbol comparisons, making profiles impractical for many large datasets. Furthermore, because they are such a rich representation, profiles can be di...
متن کاملGeneralized multiple objective bottleneck problems
We consider multiple objective combinatorial optimization problems in which the first objective is of arbitrary type and the remaining objectives are either bottleneck or k-max objective functions. While the objective value of a bottleneck objective is determined by the largest cost value of any element in a feasible solution, the k-largest element defines the objective value of the k-max objec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00114-4